A New Chaos-based Image Cipher Using a Hash Function
نویسندگان
چکیده
منابع مشابه
A New Chaos Based Image Encryption and Decryption Using a Hash Function
1Research scholar Department of Computer Science and Engineering Raipur Institute of Technology, Raipur, India 2Assistant professor Department of Computer Science and Engineering Raipur Institute of Technology, Raipur, India ---------------------------------------------------------------------***--------------------------------------------------------------------Abstract Chaos-based image encry...
متن کاملHeW: a Hash Function based on lightweight Block cipher FeW
A new hash function HeW: A hash function based on light weight block cipher FeW is proposed in this paper. The compression function of HeW is based on block cipher FeW. It is believed that key expansion algorithm of block cipher slows down the performance of the overlying hash function. Thereby, block ciphers become a less favourable choice to design a compression function. As a countermeasure,...
متن کاملImage Encryption Using Chaos and Block Cipher
In this paper, a novel image encryption scheme is proposed based on combination of pixel shuffling and new modified version of simplified AES. Chaotic baker’s map is used for shuffling and improving S-AES efficiency through S-box design. Chaos is used to expand diffusion and confusion in the image. Due to sensitivity to initial conditions, chaotic baker’s map has a good potential for designing ...
متن کاملA New Chaos-Based Image Encryption Algorithm
In this paper, we propose a new image encryption algorithm based on the Compound chaotic image encryption algorithm. The original one can’t resist chosen-plaintext attack and has weak statistical security, but our new algorithm can resist the chosen-plaintext attack using a simple improvement solution. The improvement solution is novel and transplantable, it can also be used to enhance the abil...
متن کاملRevised: Block Cipher Based Hash Function Construction From PGV
Preneel, Govaerts, and Vandewalle[12] considered the 64 most basic ways to construct a hash function from a block cipher, and regarded 12 of these 64 schemes as secure. Black, Pogaway and Shrimpton[3] proved that, in black-box model, the 12 schemes that PGV singled out as secure really are secure and given tight upper and lower bounds on their collision resistance. And also they pointed out, by...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Networked and Distributed Computing
سال: 2017
ISSN: 2211-7946
DOI: 10.2991/ijndc.2017.5.1.4